IPSD: New Coverage Preserving and Connectivity Maintenance Scheme for Improving Lifetime of Wireless Sensor Networks
نویسندگان
چکیده
In many applications it is necessary to have some guarantees on the coverage, connectivity and lifetime of the Wireless Sensor Networks(WSN). Coverage problem is regarding how to ensure that each of the points in the region to be monitored is covered by the sensors. In maximizing coverage, the sensors need to be placed not too close to each other so that the sensing capability of the network is fully utilized and at the same time they must not be located too far from each other to avoid the formation of coverage holes. On the other hand from connectivity point of view, the sensors need to be placed close enough so that they are within each other communication range thus connectivity is ensured. Once coverage and connectivity are ensured, the overall lifetime of the network gets increased thereby improving the quality of service (QoS) of the Wireless Sensor Network (WSN). The concept of Integer Programmed Sensor Deployment (IPSD) scheme is being proposed, with a set of relay nodes a triangular lattice is formed by the grid based approach thus providing maximum coverage and connectivity. Integer Linear Programming (ILP) is brought into existence for eliminating the unused relay nodes thereby enhancing the coverage and connectivity with minimum number of relay nodes. Simulation is performed using NS-2 and the results shows that the proposed scheme provides better results in large scale WSN with improved coverage and connectivity. Key-Words:WSN,ILP, relay node, coverage, connectivity.
منابع مشابه
Representing a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors
Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...
متن کاملRepresenting a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors
Wireless sensor networks are often located in areas where access to them is difficult or dangerous. Today, in wireless sensor networks, cluster-based routing protocols by dividing sensor nodes into distinct clusters and selecting local head-clusters to combine and send information of each cluster to the base station and balanced energy consumption by network nodes, get the best performance ...
متن کاملCoverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm
Wireless sensor networks have been widely considered as one of the most important 21th century technologies and are used in so many applications such as environmental monitoring, security and surveillance. Wireless sensor networks are used when it is not possible or convenient to supply signaling or power supply wires to a wireless sensor node. The wireless sensor node must be battery powered.C...
متن کاملENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
Mobile sensor networks rely heavily on inter-sensor connectivity for collection of data. Nodes in these networks monitor different regions of an area of interest and collectively present a global overview of some monitored activities or phenomena. A failure of a sensor leads to loss of connectivity and may cause partitioning of the network into disjoint segments. A number of approaches have be...
متن کاملHybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
Key distribution is an important problem in wireless sensor networks where sensor nodesare randomly scattered in adversarial environments.Due to the random deployment of sensors, a list of keys must be pre-distributed to each sensor node before deployment. To establish a secure communication, two nodes must share common key from their key-rings. Otherwise, they can find a key- path in which ens...
متن کامل